Stochastic Global Optimization and Its Applications with Fuzzy Adaptive Simulated Annealing
نویسندگان
چکیده
Stochastic global optimization is a very important subject, that has applications in virtually all areas of science and technology. Therefore there is nothing more opportune than writing a book about a successful and mature algorithm that turned out to be a good tool in solving difficult problems. Here we present some techniques for solving several problems by means of Fuzzy Adaptive Simulated Annealing (Fuzzy ASA), a fuzzycontrolled version of ASA, and by ASA itself.
منابع مشابه
Global Optimization Method for Design Problems
Article history: Received: 13.2.2015. Received in revised form: 24.3.2015. Accepted: 27.3.2015. In structural design optimization method, numerical techniques are increasingly used. In typical structural optimization problems there may be many locally minimum configurations. For that reason, the application of a global method, which may escape from the locally minimum points, remains essential....
متن کاملAdaptive neuro-fuzzy inference system and neural network in predicting the size of monodisperse silica and process optimization via simulated annealing algorithm
In this study, Back-propagation neural network (BPNN) and adaptive neuro-fuzzy inference system (ANFIS) methods were applied to estimate the particle size of silica prepared by sol-gel technique. Simulated annealing algorithm (SAA) employed to determine the optimum practical parameters of the silica production. Accordingly, the process parameters, i.e. tetraethyl orthosilicate (TEOS), H2O and N...
متن کاملA fuzzy adaptive turbulent particle swarm optimisation
Particle Swarm Optimisation (PSO) algorithm is a stochastic search technique, which has exhibited good performance across a wide range of applications. However, very often for multimodal problems involving high dimensions, the algorithm tends to suffer from premature convergence. Analysis of the behaviour of the particle swarm model reveals that such premature convergence is mainly due to the d...
متن کاملAdaptive annealing for chaotic optimization
The chaotic simulated annealing algorithm for combinatorial optimization problems is examined in the light of the global bifurcation structure of the chaotic neural networks. We show that the result of the chaotic simulated annealing algorithm is primarily dependent upon the global bifurcation structure of the chaotic neural networks and unlike the stochastic simulated annealing infinitely slow...
متن کاملAdaptive search with stochastic acceptance probabilities for global optimization
We present an extension of continuous domain Simulated Annealing. Our algorithm employs a globally reaching candidate generator, adaptive stochastic acceptance probabilities, and converges in probability to the optimal value. An application to simulation-optimization problems with asymptotically diminishing errors is presented. Numerical results on a noisy protein-folding problem are included.
متن کامل